Guidelines for LCS 2001 Paper Submissions
نویسندگان
چکیده
This paper proposes a novel two-stage method for motion segmentation under stationary background conditions. First motion vectors are extracted using an attention based method. Then a region growing technique is applied to these vectors to obtain motion segmentation and completes motion segmentation with region matching. The algorithm is tested on various video data and experimental results show that the proposed approach can extract detailed motion information from non-rigid objects such as moving people.
منابع مشابه
Formalized analysis of structural characteristics of large complex systems
Macrostructural modelization is paramount to the development of large complex systems (LCS). However, effective methodology has not been well established for macrostructural modelization of LCS. This paper explores the macrostructural modelization of LCS in terms of block diagram based model and grammar based model. Firstly, the macrostructural modelization problem of LCS is formulated. Secondl...
متن کاملTBoxes do not Yield a Compact Representation of Least Common Subsumers
For Description Logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the input descriptions. This paper investigates whether the possibly exponentially large concept description representing the lcs can always be represented in a more compact way when using an appropriate (acyclic) TBox for deening this d...
متن کاملA Biomechanical Approach for the Study of Two-Phase Blood Flow Through Stenosed Artery
These are the manuscript preparation guidelines used as a standard template for all journal submissions. Author must follow these instructions while preparing/modifying these guidelines. This guideline is used for all journals. These are the manuscript preparation guidelines used as a standard template for all journal submissions. Author must follow these instructions while preparing/modifying ...
متن کاملComputing Least Common Subsumers in ALEN
Computing the least common subsumer (lcs) has proved to be useful in a variety of different applications. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN , which allo...
متن کاملEeective Lossy Queue Languages
Although the set of reachable states of a lossy channel system (LCS) is regular, it is well-known that this set cannot be constructed eeectively. In this paper, we characterize signiicant classes of LCS for which the set of reachable states can be computed. Furthermore, we show that, for slight generatlizations of these classes, computability can no longer be achieved. To carry out our study, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007